n,p1,p2,p3,t1,t2=map(int,input().split())
def interval(x):
if x<=t1:
return x*p1
elif x<=t1+t2:
return x*p2+t1*(p1-p2)
else:
return x*p3+t2*(p2-p3)+t1*(p1-p3)
e1,e2=0,0
for i in range(n):
a,b=map(int,input().split())
e1+=(b-a)*p1
if i>0:
e2+=interval(a-b0)
b0=b
print(e1+e2)#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,p1,p2,p3,t1,t2,sum=0;
cin>>n>>p1>>p2>>p3>>t1>>t2;
int l[n],r[n];
for(int i=0;i<n;i++)
{
cin>>l[i]>>r[i];
sum=sum+(r[i]-l[i])*p1;
}
for(int i=0;i<n-1;i++)
{
if(l[i+1]-r[i]<=t1)
sum=sum+(l[i+1]-r[i])*p1;
else if(t1<l[i+1]-r[i] && l[i+1]-r[i]<=t1+t2)
sum= sum+ t1*p1 +(-r[i]+l[i+1]-t1)*p2;
else if(t1+t2<-r[i]+l[i+1])
sum=sum+t1*p1+t2*p2+(-r[i]+l[i+1]-t1-t2)*p3;
}
cout<<sum;
}1173B - Nauuo and Chess | 318B - Strings of Power |
1625A - Ancient Civilization | 864A - Fair Game |
1663B - Mike's Sequence | 448A - Rewards |
1622A - Construct a Rectangle | 1620A - Equal or Not Equal |
1517A - Sum of 2050 | 620A - Professor GukiZ's Robot |
1342A - Road To Zero | 1520A - Do Not Be Distracted |
352A - Jeff and Digits | 1327A - Sum of Odd Integers |
1276A - As Simple as One and Two | 812C - Sagheer and Nubian Market |
272A - Dima and Friends | 1352C - K-th Not Divisible by n |
545C - Woodcutters | 1528B - Kavi on Pairing Duty |
339B - Xenia and Ringroad | 189A - Cut Ribbon |
1182A - Filling Shapes | 82A - Double Cola |
45A - Codecraft III | 1242A - Tile Painting |
1663E - Are You Safe | 1663D - Is it rated - 3 |
1311A - Add Odd or Subtract Even | 977F - Consecutive Subsequence |